home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
kermit.columbia.edu
/
kermit.columbia.edu.tar
/
kermit.columbia.edu
/
newsgroups
/
misc.20031118-20041115
/
000003_fdc@columbia.edu_Sat Nov 22 12:11:53 2003.msg
< prev
next >
Wrap
Internet Message Format
|
2004-11-14
|
1KB
Path: newsmaster.cc.columbia.edu!not-for-mail
From: Frank da Cruz <fdc@columbia.edu>
Newsgroups: comp.protocols.kermit.misc
Subject: The Eight Queens Problem
Date: 22 Nov 2003 17:10:12 GMT
Organization: Columbia University
Lines: 21
Message-ID: <slrnbrv63k.e71.fdc@sesame.cc.columbia.edu>
NNTP-Posting-Host: sesame.cc.columbia.edu
X-Trace: newsmaster.cc.columbia.edu 1069521012 6870 128.59.59.56 (22 Nov 2003 17:10:12 GMT)
X-Complaints-To: postmaster@columbia.edu
NNTP-Posting-Date: 22 Nov 2003 17:10:12 GMT
User-Agent: slrn/0.9.7.4 (SunOS)
Xref: newsmaster.cc.columbia.edu comp.protocols.kermit.misc:14679
>From Dat Thuc Nguyen:
: Prof. Dr. Niklaus Wirth described the 8-Queens Problem in details at:
: http://www.acm.org/classics/dec95/.
: Since the introduction of the S-Expression in C-Kermit 8.0, I saw that
: Wirth's outlined solution can be implemented concisely in the C-Kermit
: scripting language.
;
: The attached C-Kermit script provides 92 solutions as Wirth found.
: Thanks to both Frank da Cruz and Niklaus Wirth for an inspirational
: experience with the art of programming.
Dat's new script has been placed in the Kermit script library:
http://www.columbia.edu/kermit/ckscripts.html
as:
ftp://kermit.columbia.edu/kermit/scripts/ckermit/the8queens
- Frank